the problem of scheduling several products on a single facility with the simulated annealing technique

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique. this heuristic gives a sharper upper bound upper bound to holding and setup costs.